/**
 * @author SaoE
 * @date 2025/3/2 17:34
 */
public class _70 {
    public int climbStairs(int n) {
        if (n == 0 || n == 1){
            return n;
        }
        int[] dp = new int[n+1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++){
            dp[i] = dp[i-1] + dp[i-2];
        }

        return dp[n];
    }
}
